Browsing by Subject "Message complexity"

Now showing items 1-5 of 5

    • Article  

      Computing on a partially eponymous ring 

      Mavronicolas, Marios; Michael, Loizos; Spirakis, Paul G. (2009)
      We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
    • Article  

      Computing on a partially eponymous ring 

      Mavronicolas, Marios; Michael, Loizos; Spirakis, Paul G. (2006)
      We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
    • Conference Object  

      Confidential gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing ...
    • Article  

      Meeting the deadline: On the complexity of fault-tolerant continuous gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Conference Object  

      Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2010)
      In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...